Efficient cryptographic substitution box design using travelling salesman problem and chaos
نویسندگان
چکیده
منابع مشابه
Efficient Cryptographic Substitution Box Design Using Travelling Salesman Problem and Chaos
Symmetric encryption has been a standout amongst the most reliable option by which security is accomplished. In modern block symmetric ciphers, the substitution-boxes have been playing a critical role of nonlinear components that drives the actual security of ciphers. In this paper, the travelling salesman problem and piece-wise linear chaotic map are explored to synthesize an efficient configu...
متن کاملImplementation of Travelling Salesman Problem Using ant Colony Optimization
Within the Artificial Intelligence community, there is great need for fast and accurate traversal algorithms, specifically those that find a path from a start to goal with minimum cost. Cost can be distance, time, money, energy, etc. Travelling salesman problem (TSP) is a combinatorial optimization problem. TSP is the most intensively studied problem in the area of optimization. Ant colony opti...
متن کاملAn Improved Ant Colony Algorithm Based on 3-opt and Chaos for Travelling Salesman Problem
This paper presents an improved chaotic ant colony system algorithm (ICACS) for solving combinatorial optimization problems. The existing algorithms still have some imperfections, we use a combination of two different operators to improve the performance of algorithm in this work. First, 3-opt local search is used as a framework for the implementation of the ACS to improve the solution quality;...
متن کاملApproaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
Genetic algorithms (GAs) were developed as problem independent search algorithms (Goldberg, 1989; Holland, 1975; Man et al., 1999), which simulate the biological evolution to search for an optimal solution to a problem. Figure 1(a) shows the main processes of genetic algorithms. When developing a genetic algorithm, we analyze the properties of the problem and determine the “gene encoding” polic...
متن کاملParallel Implementation of Travelling Salesman Problem using Ant Colony Optimization
In this paper we have proposed parallel implementation of Ant colony optimization Ant System algorithm on GPU using OpenCL. We have done comparison on different parameters of the ACO which directly or indirectly affect the result. Parallel comparison of speedup between CPU and GPU implementation is done with a speed up of 3.11x in CPU and 7.21x in GPU. The control parameters α, β, ρ is done wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Perspectives in Science
سال: 2016
ISSN: 2213-0209
DOI: 10.1016/j.pisc.2016.06.001